Metric structure of random networks
نویسندگان
چکیده
منابع مشابه
On the Structure of Metric-like Spaces
The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...
متن کاملConnectivity of Metric Random Graphs
For any given r ≥ 0, a random set of n points X1, . . . , Xn in the unit disc in the Euclidean plane induces a metric random graph G(n, r) with vertex set {1, . . . , n} and edge set { {i, j} : |Xi − Xj| ≤ r } where |Xi − Xj| denotes the Euclidean distance between the points Xi and Xj. Connectivity results analogous to the classical results of Erdös and Renyi forGn,p are shown to hold in this s...
متن کاملThe Wijsman structure of a quantale-valued metric space
We define and study a quantale-valued Wijsman structure on the hyperspace of all non-empty closed sets of a quantale-valued metric space. We show its admissibility and that the metrical coreflection coincides with the quantale-valued Hausdorff metric and that, for a metric space, the topological coreflection coincides with the classical Wijsman topology. We further define an index of compactnes...
متن کاملA Quest to Unravel the Metric Structure Behind Perturbed Networks
Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of a (potentially continuous) hidden domain or process. Subsequent analysis, processing, and inferences are then performed on this observed graph. In this paper we advocate the perspective that an observed graph is often...
متن کاملMetric Dimension for Random Graphs
The metric dimension of a graph G is the minimum number of vertices in a subset S of the vertex set of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric dimension of the random graph G(n, p) for a wide range of probabilities p = p(n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B
سال: 2003
ISSN: 0550-3213
DOI: 10.1016/s0550-3213(02)01119-7